Chordal problem - PDFSEARCH.IO - Document Search Engine

Chordal problem
Results: 25

#	Item
11	An effective 3-in-1 keyword search method over heterogeneous data sources Add to Reading List Source URL: dbgroup.cs.tsinghua.edu.cn Language: English - Date: 2012-09-26 08:02:06 Graph Tree Shortest path problem Degree Planar separator theorem Chordal graph Graph theory Mathematics Theoretical computer science
12	Finding a Minimal Tree in a Polygon with its Medial Axis Herman J. Haverkort Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 16:00:09 Graph connectivity Steiner tree problem Tree decomposition Tree Halin graph Chordal graph Graph Path Path decomposition Graph theory Planar graphs Graph operations
13	Graph Crossing Number and Isomorphism SPUR Final Paper, Summer 2012 Mark Velednitsky Mentor Adam Bouland Problem suggested by Adam Bouland, Jacob Fox MIT Add to Reading List Source URL: math.mit.edu Language: English - Date: 2013-02-04 10:20:57 Morphisms Graph coloring Graph embedding Planar graphs Crossing number Graph isomorphism problem Neighbourhood Chordal graph Graph isomorphism Graph theory Mathematics Topological graph theory
14	Graph-theoretic methods in combinatorial (algebraic) topology Michal Adamaszek Universit¨ at Bremen Add to Reading List Source URL: projects.au.dk Language: English - Date: 2013-04-29 03:32:40 Triangulation Clique NP-complete problems Graph coloring Simplicial complex Chordal graph Clique problem Hadwiger conjecture Graph theory Mathematics Algebraic topology
15	arXiv:1107.1052v1 [cs.DS] 6 JulThe traveling salesman problem on cubic and subcubic graphs∗ Sylvia Boyd† Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-07-06 20:12:57 Matching Eulerian path Petersen graph Travelling salesman problem Graph Tree Chordal graph Hamiltonian path Planar graph Graph theory NP-complete problems Cubic graph
16	Journal of Artificial Intelligence Research–388 Submitted 10/11; publishedComputing All-Pairs Shortest Paths by Leveraging Low Treewidth Add to Reading List Source URL: www.jair.org Language: English - Date: 2012-03-19 16:09:33 Tree decomposition Interval graph Floyd–Warshall algorithm Neighbourhood Clique Split graph Shortest path problem Path decomposition Degeneracy Graph theory Graph operations Chordal graph
17	Algorithms CS 6820 Fall 2009 Problem Set 5 Due November 11, 2009 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-10-30 17:40:59 Graph operations Connectivity Tree decomposition Graph Travelling salesman problem Tree Line graph Chordal graph Graph theory NP-complete problems Graph coloring
18	STAT 535 Lecture 6 Inference in Graphical models: Sum-Product Algorithm c Marina Meil˘a [removed] Add to Reading List Source URL: www.stat.washington.edu Language: English - Date: 2015-02-05 19:48:58 Clique Graphical model NP-complete problems Tree decomposition Belief propagation Path decomposition Clique problem Graph theory Graph operations Chordal graph
19	How many landmark colors are needed to avoid confusion in a polygon? Lawrence H. Erickson and Steven M. LaValle Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL[removed]USA {lericks4, la Add to Reading List Source URL: msl.cs.uiuc.edu Language: English - Date: 2011-10-14 01:38:18 Mathematics Art gallery problem Simple polygon Vertex Chordal graph Polygon Star-shaped polygon Visibility graph Cycle Geometry Graph theory Polygons
20	Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience Dmitri Loguinov, Anuj Kumar, Vivek Rai, Sai Ganesh Department of Computer Science Texas A&M University College Station, Add to Reading List Source URL: conferences.sigcomm.org Language: English - Date: 2003-07-24 11:26:27 Graph Chordal graph Shortest path problem Induced path Distributed hash table Tree Moore graph Networks Koorde Graph theory Network theory Distributed data storage

UPDATE